Investigating Layout Complexity

نویسندگان

  • Tim Comber
  • John R. Maltby
چکیده

This paper presents work-in-progress in assessing the usefulness of a layout complexity metric in evaluating the usability of different screen designs. The metric is based on the Shannon formula from communication theory. Initially the metric was applied to thirteen Windows applications where thirty subjects were asked to rank screens on the basis of “good” design. A significant negative correlation was found between the subjects’ rankings and the complexity ratings, indicating that users do not like “simple” screens. For the next stage a pilot application, “Launcher”, was developed in Visual Basic to calculate complexity and collected usability data. Seven subjects provided some evidence that a layout complexity metric could be of benefit to the screen designer. However, though Launcher proved useful in collecting data, some problems need to be overcome, namely more concise data collection and a better method for building screens, before more data can be collected. The final version of “Launcher” should provide conclusive evidence of the worth of the layout complexity metric as well as showing that usability metrics can be built into the design environment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Machine Reliability in a Dynamic Cellular Manufacturing System: A Comprehensive Approach to a Cell Layout Problem

The fundamental function of a cellular manufacturing system (CMS) is based on definition and recognition of a type of similarity among parts that should be produced in a planning period. Cell formation (CF) and cell layout design are two important steps in implementation of the CMS. This paper represents a new nonlinear mathematical programming model for dynamic cell formation that employs the ...

متن کامل

Applications of two new algorithms of cuckoo optimization (CO) and forest optimization (FO) for solving single row facility layout problem (SRFLP)

Nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. Single row facility layout problem (SRFLP) is a NP-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...

متن کامل

Investigating the relationship among complexity, range, and strength of grammatical knowledge of EFL students

Assessment  of  grammatical  knowledge  is  a  rather  neglected  area  of  research  in  the  field with  many  open  questions  (Purpura,  2004).  The  present  research  incorporates  recent proposals  about  the  nature  of  grammatical  development  to  create  a  framework  consisting of dimensions of complexity, range and strength, and studies which dimension(s) can best predict the stat...

متن کامل

Experimenting with Layout and Notation in UML Diagrams

This paper summarises an empirical research project that is investigating the impact of UML diagram notation and layout characteristics. The goal is to improve the effectiveness of these diagrams by identifying factors that assist human comprehension.

متن کامل

A New Approach for Investigating the Complexity of Short Term EEG Signal Based on Neural Network

 Background and purpose: The nonlinear quality of electroencephalography (EEG), like other irregular signals, can be quantified. Some of these values, such as Lyapunovchr('39')s representative, study the signal path divergence and some quantifiers need to reconstruct the signal path but some do not. However, all of these quantifiers require a long signal to quantify the signal complexity. Mate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996